On a fast direct elliptic solver by a modified Fourier method

We describe high order numerical algorithms for the solution of second order elliptic equations in rectangular domains. These algorithms are based on the Fourier method in combination with a subtraction procedure. The singularities at the corner points, arising due to non-smoothness of the boundaries, are treated explicitly using properly constructed singular corner functions. The present algorithm is a generalization of the Fast Poisson Solver developed in our previous paper. This revised version was published online in August 2006 with corrections to the Cover Date.     

Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.     

Differentiators and the geometry of polynomials

In 1959, Davis introduced the concept of a differentiator of an operator on a finite-dimensional Hilbert space. We prove that every such operator possesses a differentiator. We also use the theory of differentiators to solve several problems in the geometry of polynomials. For instance, we answer in the affirmative a twenty year old unsolved conjecture of Schoenberg, a related conjecture of Katsoprinakis and a fifty year old unsolved conjecture of De Bruijn and Springer.     

用频域法实现圆环形目标物的计数

研究了用频域法实现圆环形目标物计数的方法。对空域中含有圆环形目标物的二值图像，经傅里叶变换后在频域内进行滤波，再经傅里叶反变换后取一阈值进行处理，则对应于圆环形目标物即变为一个实心体，然后对实心体进行计数即可实现对圆环形目标物的计数。对该方法进行了数学描述，并分别用模拟图像和实际图像进行了实验。结果表明，该方法消除噪声的效果好，对部分封闭圆的检测同样有效，且可用于目标物有粘连的情况。该方法对圆环形目标物的尺寸相差不大的情况更为有效。     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

Sparse generalized Fourier transforms

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25     

Optimal reconstruction of the solution of the wave equation from inaccurate initial data

In the present paper, we consider the problem of the optimal reconstruction of the solution of the wave equation from the approximate values of the Fourier coefficients of the function specifying the initial form of the string. For an operator defined on the weight space of vectors from l ₂, we present the solution of the more general problem of reconstruction from the approximate values of the coordinates of these vectors.     

On multiple integrals of special form

Multiple integrals generalizing the iterated kernels of integral operators are expressed as single integrals in the case of a special representation of the kernel (this is our theorem). Besides integral equations, Markov processes involve these integrals as well. As a consequence of the theorem, we obtain transition probability densities of certain Markov processes. As an illustration, we consider nine examples.     

傅里叶变换红外光谱仪遥测污染云团的吸收光谱算法

遥感傅里叶变换红外光谱技术因其具有对污染源作无干扰监测、多组分的同时连续测定、区域性或大范围地区的测量等优点,因而已广泛的应用于遥感测量技术。利用傅里叶变换红外(FTIR)光谱仪远距离探测目标,根据探测的目标源是否充满光谱仪的视场,建立了三种辐射模型。在所建立模型的基础上,选用了D&P公司生产的便携式Model-101型傅里叶变换红外光谱仪,实时探测目标云团和背景,运用差谱法和发射光谱法对探测结果进行了光谱分析,进而得到了扣除背景影响后的目标云团吸收光谱。给出了相应的仿真实验结果示例。实验结果表明,由差谱法得到的结果准确度较好。